Cryptanalysis of a key agreement protocol based on chaotic Hash

نویسنده

  • Debiao He
چکیده

With the rapid development of theory and application of chaos, more and more researchers are focusing on chaos based cryptosystems. Recently, Guo et al.’s [X. Guo, J. Zhang, Secure group key agreement protocol based on chaotic Hash, Information Sciences 180 (2010) 4069–4074] proposed a secure key agreement protocol based on chaotic Hash. They claimed that their scheme could withstand various attacks. Unfortunately, by giving concrete attacks, we indicate that Guo et al.’s scheme is vulnerable to the off-line password guessing attack. The analysis shows Guo et al.’s scheme is not secure for practical application.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Two-party Password-Authenticated Key Agreement Protocol with Privacy Protection Based on Chaotic Maps

Since the 1990s, chaotic systems have widely used to cryptography which can be used to design kinds of secure protocols, digital signatures, hash functions and so on. Recently, Guo and Zhang proposed an chaotic public-key cryptosystem based key agreement protocol. In 2015, Lee has proved that Guo et al.’s scheme cannot resist off-line password guess attack. Then, Liu and Xue further point out t...

متن کامل

Cryptanalysis of a New Efficient Authenticated Multiple-Key Exchange Protocol from Bilinear Pairings

The main goal of this paper is to analyze the security of a multiple-key agreement protocol and to show that this protocol is vulnerable to forgery attack. In order to address the security weakness, a new efficient multiple-key agreement protocol is proposed. The proposed protocol is based on bilinear pairings and utilizes a novel signature scheme without one-way hash functions. In contrast to ...

متن کامل

A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices

emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...

متن کامل

Cryptanalysis on improved user efficient blind signatures - Electronics Letters

Discussion: We point out here that we have modified the original protocol [8] in signature signing and verification equations. Two recent attacks [IO, 111 on the original protocol cannot work successfully in this modified protocol. This modified protocol does not increase any computational load and the key agreement protocol does not involve any additional one-way hash function. The signatures,...

متن کامل

Provably Secure Multi-server Privacy-Protection System Based on Chebyshev Chaotic Maps without Using Symmetric Cryptography

Most of the privacy-protection schemes adopting chaotic maps are usually by symmetric cryptography for guaranteeing identity hiding. This will lead to a high calculated amount. So, the paper will wipe out the symmetric cryptography, and only use chaotic maps, a secure one-way hash function to construct a provable privacy-protection system (PPS) which can achieve two kinds of privacyprotection a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJESDF

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2011